Computations on Nondeterministic Cellular Automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cellular Automata Using Infinite Computations

This paper presents an application of the Infinite Unit Axiom, introduced by Yaroslav Sergeyev, (see [11] [14]) to the development of one-dimensional cellular automata. This application allows the establishment of a new and more precise metric on the space of definition for one-dimensional cellular automata, whereby accuracy of computations is increased. Using this new metric, open disks are de...

متن کامل

On Monogenic Nondeterministic Automata

A finite automaton is said to be directable if it has an input word, a directing word, which takes it from every state into the same state. For nondeterministic (n.d.) automata, directability can be generalized in several ways, three such notions, D1-, D2-, and D3-directability, are used. In this paper, we consider monogenic n.d. automata, and for each i = 1, 2, 3, we present sharp bounds for t...

متن کامل

Two Cellular Automata for Plasma Computations

Plasma ap plicati ons of comput ational techniques based on cellular auto mat a are inhibited by the long-ran ge nature of electromagnetic forc es . On e of the most promis ing features of cellu lar automata methods has been th e parallelism that becomes possible because of the local natu re of th e interactions , leading (for example) to t he absence of Poisson equat ions to be solved in fluid...

متن کامل

On Complementing Nondeterministic Büchi Automata

Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value. Recently, Kupferman and Vardi described a com...

متن کامل

Cellular automata computations and secret key cryptography

Franciszek Seredynski *, Pascal Bouvry , Albert Y. Zomaya d a Polish–Japanese Institute of Information Technologies, Koszykowa 86, 02-008 Warsaw, Poland b Institute of Computer Science of Polish Academy of Sciences, Ordona 21, 01-237 Warsaw, Poland c Faculty of Sciences, Technology and Communication, Luxembourg University 6, rue Coudenhove Kalergi, L-1359 Luxembourg-Kirchberg, Luxembourg d Scho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1999

ISSN: 0890-5401

DOI: 10.1006/inco.1998.2741